Class of Binary Generalized Goppa Codes Perfect in Weighted Hamming Metric
نویسندگان
چکیده
The class of the binary generalized Goppa codes is offered. It is shown that the codes of this class are on the Hamming bound constructed for a weighted metric.
منابع مشابه
Weighted Hamming Metric Structures
A weighted Hamming metric is introduced in [4] and it showed that the binary generalized Goppa code is a perfect code in some weighted Hamming metric. In this paper, we study the weight structures which admit the binary Hamming code and the extended binary Hamming code to be perfect codes in the weighted Hamming metric. And, we also give some structures of a 2-perfect code and how to construct ...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملThe Digital Fingerprinting Method for Static Images Based on Weighted Hamming Metric and on Weighted Container Model
The algorithm of fingerprint constructing for still images based on weighted image structure model is proposed. The error correcting codes that are perfect in weighted Hamming metric are used as a base for fingerprint constructing.
متن کاملOn Perfect Codes and Tilings: Problems and Solutions
Although nontrivial perfect binary codes exist only for length n = 2m−1 with m ≥ 3 and for length n = 23, many problems concerning these codes remain unsolved. Herein, we present solutions to some of these problems. In particular, we show that the smallest nonempty intersection of two perfect codes of length 2m − 1 consists of two codewords, for all m ≥ 3. We also provide a complete solution to...
متن کاملParameters of Goppa codes revisited
We discuss parameters of Goppa codes, such as minimum distance, covering radius, distance distribution, and generalized Hamming weights. By a variation on the exponential sums method and combinatorial arguments, we sharpen known bounds.
متن کامل